Fast Parallel I/O on Cluster Computers
نویسندگان
چکیده
Today’s cluster computers suffer from slow I/O, which slows down I/O-intensive applications. We show that fast disk I/O can be achieved by operating a parallel file system over fast networks such as Myrinet or Gigabit Ethernet. In this paper, we demonstrate how the ParaStation3 communication system helps speed-up the performance of parallel I/O on clusters using the open source parallel virtual file system (PVFS) as testbed and production system. We will describe the set-up of PVFS on the Alpha-Linux-Cluster-Engine (ALiCE) located at Wuppertal University, Germany. Benchmarks on ALiCE achieve write-performances of up to 1 GB/s from a 32-processor compute-partition to a 32-processor PVFS I/Opartition, outperforming known benchmark results for PVFS on the same network by more than a factor of 2. Read-performance from buffer-cache reaches up to 2.2 GB/s. Our benchmarks are giant, I/O-intensive eigenmode problems from lattice quantum chromodynamics, demonstrating stability and performance of PVFS over Parastation in large-scale production runs.
منابع مشابه
Parallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers
This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...
متن کاملA Parallel Algorithm to Calculate the Costrank of a Network
We developed analogous parallel algorithms to implement CostRank for distributed memory parallel computers using multi processors. Our intent is to make CostRank calculations for the growing number of hosts in a fast and a scalable way. In the same way we intent to secure large scale networks that require fast and reliable computing to calculate the ranking of enormous graphs with thousands of ...
متن کاملThe Performance of Parallel Iterative Solvers
K e y w o r d s P a r a l l e l numerical methods, Differential equations, Code performance. 1. I N T R O D U C T I O N Large computational problems can successfully be treated on modern multiprocessor computers. However, access to a fast high-speed computer is not sufficient. One must also ensure that the great potential power of the computer is correctly exploited. The requirement that the pr...
متن کاملDistributed Software RAID Architectures for Parallel I/O in Serverless Clusters*
In a serverless cluster of computers, all local disks can be integrated as a distributed software RAID (ds-RAID) with a single I/O space. This paper presents the architecture and performance of a new RAID-x for building ds-RAID. Through experimentation, we evaluate the RAID-x along with RAID-5, chained-declustering, and RAID-10 architectures, all embedded in a Linux cluster environment. All fou...
متن کاملParallel FFT and Quick-Merge Sort on the Reflective Memory Networked Computers and a Cluster of Workstations
This paper is concerned with parallel FFT and Quick-Merge Sort. They are implemented on computers interconnected by VMIC 5579 reflective memory and a cluster of workstations (PCs) interconnected via Fast Ethernet. Message passing interface (MPI) parallel library is used for communication in a cluster of workstations. An improved parallel FFT is also presented to decrease an execution time in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره cs.DC/0303016 شماره
صفحات -
تاریخ انتشار 2003